On the safety of Nöcker's strictness analysis

This paper proves correctness of Nocker s method of strictness analysis, implemented for Clean, which is an e ective way for strictness analysis in lazy functional languages based on their operational semantics. We improve upon the work of Clark, Hankin and Hunt, which addresses correctness of the abstract reduction rules. Our method also addresses the cycle detection rules, which are the main strength of Nocker s strictness analysis. We reformulate Nocker s strictness analysis algorithm in a higherorder lambda-calculus with case, constructors, letrec, and a nondeterministic choice operator used as a union operator. Furthermore, the calculus is expressive enough to represent abstract constants like Top or Inf. The operational semantics is a small-step semantics and equality of expressions is defined by a contextual semantics that observes termination of expressions. The correctness of several reductions is proved using a context lemma and complete sets of forking and commuting diagrams. The proof is based mainly on an exact analysis of the lengths of normal order reductions. However, there remains a small gap: Currently, the proof for correctness of strictness analysis requires the conjecture that our behavioral preorder is contained in the contextual preorder. The proof is valid without referring to the conjecture, if no abstract constants are used in the analysis

A complete proof of the safety of Nöcker's strictness analysis

This paper proves correctness of Nöcker's method of strictness analysis, implemented in the Clean compiler, which is an effective way for strictness analysis in lazy functional languages based on their operational semantics. We improve upon the work of Clark, Hankin and Hunt did on the correctness of the abstract reduction rules. Our method fully considers the cycle detection rules, which are the main strength of Nöcker's strictness analysis. Our algorithm SAL is a reformulation of Nöcker's strictness analysis algorithm in a higher-order call-by-need lambda-calculus with case, constructors, letrec, and seq, extended by set constants like Top or Inf, denoting sets of expressions. It is also possible to define new set constants by recursive equations with a greatest fixpoint semantics. The operational semantics is a small-step semantics. Equality of expressions is defined by a contextual semantics that observes termination of expressions. Basically, SAL is a non-termination checker. The proof of its correctness and hence of Nöcker's strictness analysis is based mainly on an exact analysis of the lengths of normal order reduction sequences. The main measure being the number of 'essential' reductions in a normal order reduction sequence. Our tools and results provide new insights into call-by-need lambda-calculi, the role of sharing in functional programming languages, and into strictness analysis in general. The correctness result provides a foundation for Nöcker's strictness analysis in Clean, and also for its use in Haskell

Deciding subset relationship of co-inductively defined set constants

Static analysis of different non-strict functional programming languages makes use of set constants like Top, Inf, and Bot denoting all expressions, all lists without a last Nil as tail, and all non-terminating programs, respectively. We use a set language that permits union, constructors and recursive definition of set constants with a greatest fixpoint semantics. This paper proves decidability, in particular EXPTIMEcompleteness, of subset relationship of co-inductively defined sets by using algorithms and results from tree automata. This shows decidability of the test for set inclusion, which is required by certain strictness analysis algorithms in lazy functional programming languages

Transfer matrices for the totally asymmetric exclusion process

We consider the totally asymmetric simple exclusion process (TASEP) on a finite lattice with open boundaries. We show, using the recursive structure of the Markov matrix that encodes the dynamics, that there exist two transfer matrices $T_{L-1,L}$ and $\tilde{T}_{L-1,L}$ that intertwine the Markov matrices of consecutive system sizes: $\tilde{T}_{L-1,L}M_{L-1}=M_{L}T_{L-1,L}$. This semi-conjugation property of the dynamics provides an algebraic counterpart for the matrix-product representation of the steady state of the process.Comment: 7 page

Ribosome recycling, diffusion, and mRNA loop formation in translational regulation

We explore and quantify the physical and biochemical mechanisms that may be relevant in the regulation of translation. After elongation and detachment from the 3' termination site of mRNA, parts of the ribosome machinery can diffuse back to the initiation site, especially if it is held nearby, enhancing overall translation rates. The elongation steps of the mRNA-bound ribosomes are modeled using exact and asymptotic results of the totally asymmetric exclusion process (TASEP).Since the ribosome injection rates of the TASEP depend on the local concentrations at the initiation site, a source of ribosomes emanating from the termination end can feed back to the initiation site, leading to a self-consistent set of equations for the steady-state ribosome throughput. Additional mRNA binding factors can also promote loop formation, or cyclization, bringing the initiation and termination sites into close proximity. The probability distribution of the distance between the initiation and termination sites is described using simple noninteracting polymer models. We find that the initiation, or initial ribosome adsorption binding required for maximal throughput can vary dramatically depending on certain values of the bulk ribosome concentration and diffusion constant. If cooperative interactions among the loop-promoting proteins and the initiation/termination sites are considered, the throughput can be further regulated in a nonmonotonic manner. Potential experiments to test the hypothesized physical mechanisms are discussed.Comment: 21 pp, 11 .eps figs, realigned figures and magin

Visuo-tactile integration in autism: atypical temporal binding may underlie greater reliance on proprioceptive information

BackgroundEvidence indicates that social functioning deficits and sensory sensitivities in autism spectrum disorder (ASD) are related to atypical sensory integration. The exact mechanisms underlying these integration difficulties are unknown; however, two leading accounts are (1) an over-reliance on proprioception and (2) atypical visuo-tactile temporal binding. We directly tested these theories by selectively manipulating proprioceptive alignment and visuo-tactile synchrony to assess the extent that these impact upon body ownership.MethodsChildren with ASD and typically developing controls placed their hand into a multisensory illusion apparatus, which presented two, identical live video images of their own hand in the same plane as their actual hand. One virtual hand was aligned proprioceptively with the actual hand (the veridical hand), and the other was displaced to the left or right. While a brushstroke was applied to the participants’ actual (hidden) hand, they observed the two virtual images of their hand also being stroked and were asked to identify their real hand. During brushing, one of three different temporal delays was applied to either the displaced hand or the veridical hand. Thus, only one virtual hand had synchronous visuo-tactile inputs.ResultsResults showed that visuo-tactile synchrony overrides incongruent proprioceptive inputs in typically developing children but not in autistic children. Evidence for both temporally extended visuo-tactile binding and a greater reliance on proprioception are discussed.ConclusionsThis is the first study to provide definitive evidence for temporally extended visuo-tactile binding in ASD. This may result in reduced processing of amodal inputs (i.e. temporal synchrony) over modal-specific information (i.e. proprioception). This would likely lead to failures in appropriately binding information from related events, which would impact upon sensitivity to sensory stimuli, body representation and social processes such as empathy and imitation

A multi-country test of brief reappraisal interventions on emotions during the COVID-19 pandemic.

The COVID-19 pandemic has increased negative emotions and decreased positive emotions globally. Left unchecked, these emotional changes might have a wide array of adverse impacts. To reduce negative emotions and increase positive emotions, we tested the effectiveness of reappraisal, an emotion-regulation strategy that modifies how one thinks about a situation. Participants from 87 countries and regions (n = 21,644) were randomly assigned to one of two brief reappraisal interventions (reconstrual or repurposing) or one of two control conditions (active or passive). Results revealed that both reappraisal interventions (vesus both control conditions) consistently reduced negative emotions and increased positive emotions across different measures. Reconstrual and repurposing interventions had similar effects. Importantly, planned exploratory analyses indicated that reappraisal interventions did not reduce intentions to practice preventive health behaviours. The findings demonstrate the viability of creating scalable, low-cost interventions for use around the world

Striktheits-Analyse mittels abstrakter Reduktion für den Sprachkern einer nicht-strikten funktionalen Programmiersprache

Die Implementation der Striktheits-Analyse, die im Zuge dieser Arbeit vorgenommen wurde, stellt eine effiziente Approximation der abstrakten Reduktion mit Pfadanalyse dar. Durch die G#-Maschine, ein neues, auf der G-Maschine basierendes Maschinenmodell, wurde die verwendete Methode systematisch dargelegt. Die große Ähnlichkeit mit der G-Maschin, die in unserer Implementation beibehalten werden konnte, zeigt, wie natürlich die verwendete Methode der Reduktion in funktionalen Programmiersprachen entspricht. Obwohl die Umsetzung mehr Wert auf Nachvollziehbarkeit, als auf Effizienz legt, zeigt sie, daß die Methode der abstrakten Reduktion mit Pfadanalyse auch in einer funktionalen Implementierung durchaus alltagstauglich ist und Striktheits-Information findet, die Umsetzungen anderer Methoden nicht finden. Es bestehen Möglichkeiten zur Optimierung u. a. von Programmteilen, die für jede simulierte G#-Maschinen-Anweisung ausgeführt werden. Bei vorsichtiger Einschätzung erscheint eine Halbierung der Laufzeit mit vertretbarem Aufwand erreichbar